The Rules of Constraint Modelling
نویسندگان
چکیده
Many and diverse combinatorial problems have been solved successfully using finite-domain constraint programming. However, to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction or optimisation problem. Since constraints provide a rich language, typically many alternative models exist. Formulating a good model therefore requires a great deal of expertise. This paper describes CONJURE, a system that refines a specification of a problem in the abstract constraint specification language ESSENCE into a set of alternative constraint models. Refinement is compositional: alternative constraint models are generated by composing refinements of the components of the specification. Experimental results demonstrate that CONJURE is able to generate a variety of models for practical problems from their ESSENCE specifications.
منابع مشابه
The Rules of Constraint Modelling: An Overview
We address a major bottleneck in the use of constraint programming: modelling. Our system CONJURE automatically refines a specification of a problem in our abstract constraint specification language, ESSENCE, into a set of alternative constraint programs, thus automating an important part of the modelling process and helping to reduce the modelling bottleneck significantly.
متن کاملFrom Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we show that the business rules knowledge representation paradigm, which is widely used in the industry, can be developped as a front-end modelling language for constraint programming. We present a general purpose rule-based modelling language, called Rules2CP, and describe its compilation to constraint programs over finite domains with reified constraints and global constraints,...
متن کاملOCL as a Constraint Generation Language
In programming as well as in modelling, artefacts are required to comply with the rules of well-formedness given by their underlying language definition or their meta model, respectively. In many cases (e.g. the UML specification or the meta models implemented with EMF), these rules are given as Boolean typed OCL expressions, whose evaluation results indicate whether an artefact is well-formed....
متن کاملGAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING
In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...
متن کاملExtensible Automated Constraint Modelling
In constraint solving, a critical bottleneck is the formulation of an effective constraint model of a given problem. The CONJURE system described in this paper, a substantial step forward over prototype versions of CONJURE previously reported, makes a valuable contribution to the automation of constraint modelling by automatically producing constraint models from their specifications in the abs...
متن کاملOn Expressing Business Rules with a Combination of Uml and Ocl
Today’s volatile, competitive business environment demands flexible software systems that could fit changing business requirements. Therefore business rules are of great importance in the development of software systems. The Object Constraint Language (OCL) as part of the Unified Modeling Language (UML) provides the possibility to express business rules in a conceptual model unambiguously. In t...
متن کامل